Capture of particles undergoing discrete random walks.

نویسندگان

  • Robert M Ziff
  • Satya N Majumdar
  • Alain Comtet
چکیده

It is shown that particles undergoing discrete-time jumps in three dimensions, starting at a distance r(0) from the center of an adsorbing sphere of radius R, are captured with probability (R-c sigma)/r(0) for r(0)>>R, where c is related to the Fourier transform of the scaled jump distribution and sigma is the distribution's root-mean square jump length. For particles starting on the surface of the sphere, the asymptotic survival probability is nonzero (in contrast to the case of Brownian diffusion) and has a universal behavior sigma/(R square root(6)) depending only upon sigma/R. These results have applications to computer simulations of reaction and aggregation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recurrence and transience of multitype branching random walks

We study a discrete time Markov process with particles being able to perform discrete time random walks and create new particles, known as branching random walk (BRW). We suppose that there are particles of di erent types, and the transition probabilities, as well as o spring distribution, depend on the type and the position of the particle. Criteria of (strong) recurrence and transience are pr...

متن کامل

Coalescing Random Walks and Voting on Connected Graphs

In a coalescing random walk, a set of particles make independent discrete-time random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues a random walk through the graph. Let G = (V,E), be an undirected and connected graph, with n vertices and m edges. The coalescence time, C(n), is the expected time for all particles to ...

متن کامل

Collisions of random walks and related diffusions

Consider n brownian motion particles on R, S, or n discrete time random walks on a graph G. A ‘collision’ occurs when two particles have the same position at the same time. Given a rule for modeling interactions between particles, we can analyze the long term behavior of such a system. We focus on the case where particles are independent, and briefly discuss : for example, where particles are c...

متن کامل

Multiple Random Walks in Random Regular Graphs

We study properties of multiple random walks on a graph under various assumptions of interaction between the particles. To give precise results, we make the analysis for random regular graphs. The cover time of a random walk on a random r-regular graph was studied in [6], where it was shown with high probability (whp), that for r ≥ 3 the cover time is asymptotic to θrn lnn, where θr = (r − 1)/(...

متن کامل

Annihilating random walks and perfect matchings of planar graphs

Annihilating random walks (ARW) have been studied in the early 70’s within the theory of interacting particles systems (see [1],[2],[3] and [9]). The idea was to study a system of particles moving on a graph according to certain laws of attraction. The system we study in this paper is defined as follows: the initial system consists of particles at every site of 2 . Then, each particle simultane...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • The Journal of chemical physics

دوره 130 20  شماره 

صفحات  -

تاریخ انتشار 2009